Optimal online ring routing
نویسندگان
چکیده
In this talk we study how to route online splittable flows in bidirectional ring networks to minimize maximum load. We show that the competitive ratio of any deterministic online algorithm for this problem is at least 2−2/n, where n is the size of the ring, and that the online algorithm that splits each flow inversely proportionally to the length of the flow’s shortest path achieves this competitive ratio for all integers n ≥ 2.
منابع مشابه
Online Packet Routing on Linear Arrays and Rings
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this problem on linear array and ring networks. We generalize an earlier result for the offline problem by showing that Farthest First (FF) scheduling is optimal with respect to makespan on linear arrays. We also show tha...
متن کاملDesigning and implementing a Web-based real time routing service for crisis management (a case study for district 11 of Tehran)
Timing framework associated with catastrophes is one of the most important issues in crisis management. In such cases, being immediate has a considerable importance and web based real-time routing service as an important tool has a significant role in relief operations improvement. At this study, a web-based real time routing service based on open source technology has designed for 11th distric...
متن کاملHierarchical routing in layered ring and mesh optical networks
– We consider hierarchical optical networks with different granularities of paths (wavelengths and wavebands). We introduce classification layers for routing models in these networks (separated and integrated routing, homogeneous and heterogeneous networks, online and offline routing). We also propose and analyze two heuristic routing and aggregation algorithms (online and offline) to be used f...
متن کاملOnline Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio
We consider the problem of routing a message in a mesh network with faulty nodes. The number and positions of faulty nodes is unknown. It is known that a flooding strategy like expanding ring search can route a message in the minimum number of steps h while it causes a traffic (i.e. the total number of messages) of O(h). For optimizing traffic a single-path strategy is optimal producing traffic...
متن کاملImproved Bounds for Online Multi-Path Routing in Faulty Mesh Networks
We consider the problem of route discovery in a mesh network with faulty nodes. The number and the positions of the faulty nodes are unknown. It is known that a flooding strategy like expanding ring search can route a message linear in the minimum number of steps d while it causes a traffic (i.e. the total number of messages) of O(d). For optimizing traffic a single-path strategy is optimal pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 57 شماره
صفحات -
تاریخ انتشار 2011